Refinement in the Tableau Synthesis Framework
نویسندگان
چکیده
This paper is concerned with the possibilities of refining and improving calculi generated in the tableau synthesis framework [10]. A general method in the tableau synthesis framework allows to reduce the branching factor of tableau rules and preserves completeness if a general rule refinement condition holds. In this paper we consider two approaches to satisfy this general rule refinement condition.
منابع مشابه
Terminating tableau calculi for modal logic K with global counting operators
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...
متن کاملSynthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...
متن کاملSynthesis and Characterization of Nanocrystalline Ni3Al Intermetallic during Mechanical Alloying Process
In this research, formation of nanocrystalline Ni3Al intermetallic from Ni and Al elemental powders by mechanical alloying (MA) process and its characterization was investigated. Therefore, the evolutions in microstructure such as phase transformation, oxidation in air and introduction of Fe impurity from milling media after MA were evaluated using XRD, Rietveld refinement, TEM, SEM, EDS and IC...
متن کاملA Tableau-Based Theorem Proving Method for Intuitionistic Logic
A new tableau-based calculus for first-order intuitionistic logic is proposed. The calculus is obtained from the tableau calculus for classical logic by extending its rules by A-terms. Aterms are seen as compact representation of natural deduction proofs. The benefits from that approach are two-fold. First, proof search methods known for classical logic can be adopted: Run-time-Skolemization an...
متن کاملAn Abstract Tableau Calculus for the Description Logic SHOI Using Unrestricted Blocking and Rewriting
This paper presents an abstract tableau calculus for the description logic SHOI. SHOI is the extension of ALC with singleton concepts, role inverse, transitive roles and role inclusion axioms. The presented tableau calculus is inspired by a recently introduced tableau synthesis framework. Termination is achieved by a variation of the unrestricted blocking mechanism that immediately rewrites ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.3131 شماره
صفحات -
تاریخ انتشار 2013